Knowledge-driven graph similarity for text classification
نویسندگان
چکیده
منابع مشابه
Kernels and Similarity Measures for Text Classification
Measuring similarity between two strings is a fundamental step in text classification and other problems of information retrieval. Recently, kernel-based methods have been proposed for this task; since kernels are inner products in a feature space, they naturally induce similarity measures. Information theoretic (dis)similarities have also been the subject of recent research. This paper describ...
متن کاملTerm Graph Model for Text Classification
Most existing text classification methods (and text mining methods at large) are based on representing the documents using the traditional vector space model. We argue that important information, such as the relationship among words, is lost. We propose a term graph model to represent not only the content of a document but also the relationship among the keywords. We demonstrate that the new mo...
متن کاملText-Enhanced Representation Learning for Knowledge Graph
Learning the representations of a knowledge graph has attracted significant research interest in the field of intelligent Web. By regarding each relation as one translation from head entity to tail entity, translation-based methods including TransE, TransH and TransR are simple, effective and achieving the state-of-the-art performance. However, they still suffer the following issues: (i) low pe...
متن کاملKnowledge-Rich Similarity-Based Classification
This paper proposes to enhance similarity-based classification with different types of imperfect domain knowledge. We introduce a hierarchy of knowledge types and show how the types can be incorporated into similarity measures. Furthermore, we analyze how properties of the domain theory, such as partialness and vagueness, influence classification accuracy. Experiments in a simple domain suggest...
متن کاملGraph Based Similarity Measures for Synonym Extraction from Parsed Text
We learn graph-based similarity measures for the task of extracting word synonyms from a corpus of parsed text. A constrained graph walk variant that has been successfully applied in the past in similar settings is shown to outperform a state-of-the-art syntactic vectorbased approach on this task. Further, we show that learning specialized similarity measures for different word types is advanta...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Machine Learning and Cybernetics
سال: 2020
ISSN: 1868-8071,1868-808X
DOI: 10.1007/s13042-020-01221-4